0 Title Page
1 Why Efficient Search Matters
2 From Lists to Trees
3 Real World Scale
5 Why Trees
6 BST Roadmap
7 BST Definition
8 BST Node Structure
9 BST Min, Max, Successor, Predecessor
10 BST Search Algorithm
11 BST Search Code
12 BST Insert Algorithm
13 BST Insert Code
14 Node Deletion Case 1 (Left)
15 BST Delete Case 2 (One Child)
16 BST Delete Case 3 (Two Children)
17 BST Traversals Code
18 BST Traversals Concepts
19 Problem of Skewed BSTs
20 AVL Tree Definition
21 AVL Rotations Motivation
22 AVL Rotations Single
23 AVL Rotations Double
24 AVL Example Step by Step
25 Hash Table Basics
26 Hash Function Properties
27 Collision Handling Overview
28 Linear Probing Example
29 Quadratic and Double Hashing
30 Load Factor and Rehashing
31 Hash Table Complexity
32 BST vs Hash Properties
33 BST Applications
34 Hash Table Applications
35 Trade Offs
36 Course Summary
> Terminal ready. Click 'Run Code' to execute your code.
Your Personal AI Tutor
Ask me anything! Here are some ideas to get started:
Understand Concepts
Ask me to explain the current slide or a concept in simple terms.
Generate Code
Request code examples in different programming languages.
Use Your Tone and Language
Ask in different languages or tones and I'll adapt.
The AI assistant can make mistakes, verify important info.